Toward Combining Fuzzy Graphs Based on Hedge Algebra
نویسندگان
چکیده
منابع مشابه
Improve Efficiency of Fuzzy Association Rule Using Hedge Algebra Approach
A major problem when conducting mining fuzzy association rules from the database (DB) is the large computation time and memory needed. In addition, the selection of fuzzy sets for each attribute of the database is very important because it will affect the quality of the mining rule. This paper proposes a method for mining fuzzy association rules using compressed database. We also use the approa...
متن کاملdesigning unmanned aerial vehicle based on neuro-fuzzy systems
در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...
Extended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملCombining Computer Algebra and Rule Based Reasoning
We present extended term rewriting systems as a means to describe a simpliication relation for an equational speciication with a built-in domain of external objects. Even if the extended term rewriting system is canonical, the combined relation including built-in computations of`ground terms' needs neither be terminating nor connuent. We investigate restrictions on the extended term rewriting s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EAI Endorsed Transactions on Context-aware Systems and Applications
سال: 2019
ISSN: 2409-0026
DOI: 10.4108/eai.20-8-2019.162801